/**
 * Software License, Version 1.0
 * 
 * Copyright 2003 The Trustees of Indiana University.  All rights reserved.
 * 
 *
 *Redistribution and use in source and binary forms, with or without 
 *modification, are permitted provided that the following conditions are met:
 *
 *1) All redistributions of source code must retain the above copyright notice,
 * the list of authors in the original source code, this list of conditions and
 * the disclaimer listed in this license;
 *2) All redistributions in binary form must reproduce the above copyright 
 * notice, this list of conditions and the disclaimer listed in this license in
 * the documentation and/or other materials provided with the distribution;
 *3) Any documentation included with all redistributions must include the 
 * following acknowledgement:
 *
 *"This product includes software developed by the Community Grids Lab. For 
 * further information contact the Community Grids Lab at 
 * http://communitygrids.iu.edu/."
 *
 * Alternatively, this acknowledgement may appear in the software itself, and 
 * wherever such third-party acknowledgments normally appear.
 * 
 *4) The name Indiana University or Community Grids Lab or NaradaBrokering, 
 * shall not be used to endorse or promote products derived from this software 
 * without prior written permission from Indiana University.  For written 
 * permission, please contact the Advanced Research and Technology Institute 
 * ("ARTI") at 351 West 10th Street, Indianapolis, Indiana 46202.
 *5) Products derived from this software may not be called NaradaBrokering, 
 * nor may Indiana University or Community Grids Lab or NaradaBrokering appear
 * in their name, without prior written permission of ARTI.
 * 
 *
 * Indiana University provides no reassurances that the source code provided 
 * does not infringe the patent or any other intellectual property rights of 
 * any other entity.  Indiana University disclaims any liability to any 
 * recipient for claims brought by any other entity based on infringement of 
 * intellectual property rights or otherwise.  
 *
 *LICENSEE UNDERSTANDS THAT SOFTWARE IS PROVIDED "AS IS" FOR WHICH NO 
 *WARRANTIES AS TO CAPABILITIES OR ACCURACY ARE MADE. INDIANA UNIVERSITY GIVES
 *NO WARRANTIES AND MAKES NO REPRESENTATION THAT SOFTWARE IS FREE OF 
 *INFRINGEMENT OF THIRD PARTY PATENT, COPYRIGHT, OR OTHER PROPRIETARY RIGHTS. 
 *INDIANA UNIVERSITY MAKES NO WARRANTIES THAT SOFTWARE IS FREE FROM "BUGS", 
 *"VIRUSES", "TROJAN HORSES", "TRAP DOORS", "WORMS", OR OTHER HARMFUL CODE.  
 *LICENSEE ASSUMES THE ENTIRE RISK AS TO THE PERFORMANCE OF SOFTWARE AND/OR 
 *ASSOCIATED MATERIALS, AND TO THE PERFORMANCE AND VALIDITY OF INFORMATION 
 *GENERATED USING SOFTWARE.
 */
package cgl.narada.matching.tagvaluepairs;

import java.util.Hashtable;

import cgl.narada.matching.Profile;

/**
   This keeps track of the destinations, and the number of predicates within 
   each destination that are interested in a particular edge. This 
   irrespective of wether the edge in question is connected to another node 
   in the matching tree graph or if its simply a destination edge. The 
   destinations thus returned need to be fed into the event routing protocol, 
   which provides the shortest routes to reach destinations at different 
   levels.
   
   @author Shrideep Pallickara
   $Date$
   $Revision$
*/

public class TagValueClientEdgeAttributes 
  implements TagValueMatchingDebugFlags {
  /** Contains a list of destinations interested in the event. */ 
  private Hashtable interestedDestinations;
  
  private boolean destinationEdge = false;
  
  private int predicateCount=0;
  
  public TagValueClientEdgeAttributes(boolean destEdge) {
    destinationEdge = destEdge; 
    if (destinationEdge) {
      interestedDestinations = new Hashtable();
    }
  }

  public void addDestination(int destination, Profile profile) {

    if (destinationEdge) {
      Integer key = new Integer(destination);
      if (interestedDestinations.containsKey(key)) {
	System.out.println("Destination [" + destination + 
			   "] already present" +
			   " in the profile graph");
	return;
      }   
      interestedDestinations.put(key, profile);
    }
    predicateCount++;
  }

  public void removeDestination(int destination) {
    if (destinationEdge) {
      if (interestedDestinations == null) {
	System.out.println("TagValueClientEdgeAttributes: DestinationsTable " +
			   " associated with edge is NULL");
	return;
      }
      Integer key = new Integer(destination);
      if (interestedDestinations.containsKey(key)) {
	interestedDestinations.remove(key);
      } else {
	System.out.println("TagValueClientEdgeAttributes:: Trying to remove a " + 
			   "destination that is not available on the edge");
      }
    }
    predicateCount--;
  }
  
  /** This method serves as the precursor to the deletion of certain
      nodes and edges, in response to the removal of an interest in 
      subscription predicates. */
  public boolean containsDestinations() {
    if (interestedDestinations.size() != 0) 
      return  true;
    else return false;
  }
  
  /** Returns the list of destinations associated with the edge */
  public Hashtable getDestinations() {
    return interestedDestinations;
  }
  
  public int getPredicateCount() {
    return predicateCount;
  }

  public static void main(String[] args) {
    TagValueClientEdgeAttributes attrib = new TagValueClientEdgeAttributes(true);
    
  }
  
}
